t = int(input())
s = []
for i in range(t):
cost = input()
cost = cost.split(' ')
for j in range(len(cost)):
cost[j] = int(cost[j])
cost.sort()
r = 0
l = 0
n = int(input())
for j in range(n):
y = list(input())
r += int(y[0])
l += int(y[2])
if r > l:
r = r * int(cost[0])
l = l * int(cost[1])
else:
r = r * int(cost[1])
l = l * int(cost[0])
a = l + r
s.append(a)
for i in range(len(s)):
print(s[i])
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |